Quantization of Binary-Input Discrete Memoryless Channels
نویسندگان
چکیده
منابع مشابه
Invariance Properties of Binary Linear Block Codes over a Memoryless Channels with Discrete Input
This work studies certain properties of the Probability Density Function ( ) of the bit Log-Likelihood-Ratio ( ) for binary linear block codes over a memoryless channel with discrete input and discrete or continuous output. We prove that under a set of mild conditions on the channel, the of the bit of a specific bit position is independent of the transmitted code-word. It is also shown that the...
متن کاملOn the Symmetry of Polar Codes for Symmetric Binary-Input Discrete Memoryless Channels
In this paper, we study the symmetry of polar codes on symmetric binary-input discrete memoryless channels (B-DMC). The symmetry property of polar codes is originally pointed out in Arikan’s work for general B-DMC channels. With the symmetry, the output vector y 1 (N be the block length) can be divided into equivalence classes in terms of their transition probabilities. In this paper, we presen...
متن کاملThreshold based Stochastic Resonance for the Binary-Input Ternary-Output Discrete Memoryless Channels
In this paper, we discuss the Stochastic Resonance (SR) effect for the binary-input ternary-output (2,3) Discrete Memoryless Channels (DMC). The (2,3) DMC is of great interest for various digital communications channels, including acoustic underwater communication. We focus on the capacity maximization, brought about by additive Gaussian noise, for the (2,3) DMCs. We analyze the capacity of the...
متن کاملCommitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bid...
متن کاملAn improved upper bound on the block coding error exponent for binary-input discrete memoryless channels (Corresp.)
The recent upper bounds on the minimum distance of binary codes given by McEliece, Rodemich, Rumsey, and Welch are shown to result in improved upper bounds on the block coding error exponent for binary-input memoryless channels. The range of T for which the bound becomes independent of L, viz., T I M [nEvu(R)]-l logs L, is close to the range where the true P[e] becomes independent of L. Hence, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2327016